CHANCE CONSTRAINED BOTTLENECK SPANNING TREE PROBLEM WITH FUZZY RANDOM EDGE COSTS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chance Constrained Bottleneck Spanning Tree Problem with Fuzzy Random Edge Costs

This paper considers a generalized fuzzy random version of bottleneck spanning tree problem in which edge costs are fuzzy random variables. The problem is to find an optimal spanning tree under chance constraint with respect to possibility measure of bottleneck (maximum cost) edge of spanning tree. The problem is first transformed into a deterministic equivalent problem. Then its subproblem is ...

متن کامل

A Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights

The inverse spanning tree problem is to make a given spanning tree be a minimum spanning tree on a connected graph via a minimum perturbation on its edge weights. In this paper, a chance-constrained programming model is proposed to handle the inverse spanning tree problem where the edge weights are assumed to be uncertain variables. It is shown that such an uncertain minimum spanning tree can b...

متن کامل

Fuzzy random chance-constrained programming

By fuzzy random programming, we mean the optimization theory dealing with fuzzy random decision problems. This paper presents a new concept of chance of fuzzy random events and then constructs a general framework of fuzzy random chance-constrained programming (CCP). We also design a spectrum of fuzzy random simulations for computing uncertain functions arising in the area of fuzzy random progra...

متن کامل

Chance-Constrained Programming Models and Approximation Algorithms for General Stochastic Bottleneck Spanning Tree Problems

This paper considers a balance-constrained stochastic bottleneck spanning tree problem (BCSBSTP) in which edge weights are independently distributed but may follow arbitrary random distributions. The problem minimizes a scalar and seeks a spanning tree, of which the maximum edge weight is bounded by the scalar for a given certain probability, and meanwhile the minimum edge weight is lower bound...

متن کامل

DATA ENVELOPMENT ANALYSIS WITH FUZZY RANDOM INPUTS AND OUTPUTS: A CHANCE-CONSTRAINED PROGRAMMING APPROACH

In this paper, we deal with fuzzy random variables for inputs andoutputs in Data Envelopment Analysis (DEA). These variables are considered as fuzzyrandom flat LR numbers with known distribution. The problem is to find a method forconverting the imprecise chance-constrained DEA model into a crisp one. This can bedone by first, defuzzification of imprecise probability by constructing a suitablem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 2000

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.43.128